Distributed Association Rules Mining of Varying Data Partition Size Using Nodesets
نویسندگان
چکیده
منابع مشابه
Employing data mining to explore association rules in drug addicts
Drug addiction is a major social, economic, and hygienic challenge that impacts on all the community and needs serious threat. Available treatments are successful only in short-term unless underlying reasons making individuals prone to the phenomenon are not investigated. Nowadays, there are some treatment centers which have comprehensive information about addicted people. Therefore, given the ...
متن کاملPrediction of chronic kidney disease in Isfahan with extracting association rules using data mining techniques
Background: Millions of deaths occur around the world each year due to lack of access to appropriate treatment for chronic kidney disease patients. Given the importance and mortality rate of this disease, early and low-cost prediction is very important. The researchers intend to identify chronic kidney disease through the optimal combination of techniques used in different stages of data mining...
متن کاملdata mining rules and classification methods in insurance: the case of collision insurance
assigning premium to the insurance contract in iran mostly has based on some old rules have been authorized by government, in such a situation predicting premium by analyzing database and it’s characteristics will be definitely such a big mistake. therefore the most beneficial information one can gathered from these data is the amount of loss happens during one contract to predicting insurance ...
15 صفحه اولUsing a Distributed Deductive Database for Mining Association Rules
Deductive databases may operate in a distributed environment. One powerful extension to a traditional deductive database is the incorporation of data mining and the use of association rules. This paper explores the issues that surround finding support and confidence for mining association rules.
متن کاملFast mining frequent itemsets using Nodesets
Node-list and N-list, two novel data structure proposed in recent years, have been proven to be very efficient for mining frequent itemsets. The main problem of these structures is that they both need to encode each node of a PPC-tree with pre-order and post-order code. This causes that they are memory consuming and inconvenient to mine frequent itemsets. In this paper, we propose Nodeset, a mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Trends in Computer Science and Engineering
سال: 2020
ISSN: 2278-3091
DOI: 10.30534/ijatcse/2020/181942020